On Minimum Saturated Matrices
نویسندگان
چکیده
منابع مشابه
On Minimum Saturated Matrices
Motivated both by the work of Anstee, Griggs, and Sali on forbidden submatrices and also by the extremal sat-function for graphs, we introduce sat-type problems for matrices. Let F be a family of k-row matrices. A matrix M is called F-admissible if M contains no submatrix F ∈ F (as a row and column permutation of F ). A matrix M without repeated columns is F-saturated if M is F-admissible but t...
متن کاملAll minimum C5-saturated graphs
A graph is C5-saturated if it has no five-cycle as a subgraph, but does contain a C5 after the addition of any new edge. Extending our previous result, we prove that the minimum number of edges in a C5-saturated graph on n vertices is sat(n, C5) = ⌈10(n − 1)/7⌉ − 1 for 11 ≤ n ≤ 14, or n = 16, 18, 20, and is ⌈10(n − 1)/7⌉ for all other n ≥ 5, and we also prove that the only C5-saturated graphs w...
متن کاملOn generalized Hadamard matrices of minimum rank
Generalized Hadamard matrices of order qn−1 (q a prime power, n ≥ 2) over GF (q) are related to symmetric nets in affine 2-(qn, qn−1, (qn−1 − 1)/(q − 1)) designs invariant under an elementary abelian group of order q acting semi-regularly on points and blocks. The rank of any such matrix over GF (q) is greater than or equal to n− 1. It is proved that a matrix of minimum q-rank is unique up to a...
متن کاملUpper Bounds on the Minimum Size of Hamilton Saturated Hypergraphs
For 1 6 ` < k, an `-overlapping k-cycle is a k-uniform hypergraph in which, for some cyclic vertex ordering, every edge consists of k consecutive vertices and every two consecutive edges share exactly ` vertices. A k-uniform hypergraph H is `-Hamiltonian saturated if H does not contain an `-overlapping Hamiltonian k-cycle but every hypergraph obtained from H by adding one edge does contain such...
متن کاملA note on minimum K2, 3-saturated graphs
A graph G is said to be K2,3-saturated if G contains no copy of K2,3 as a subgraph, but for any edge e in the complement of G the graph G + e does contain a copy of K2,3. The minimum number of edges of a K2,2-saturated graph of given order n was precisely determined by Ollmann [6]. Here, we determine the asymptotic behavior for the minimum number of edges in a K2,3-saturated graph.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2012
ISSN: 0911-0119,1435-5914
DOI: 10.1007/s00373-012-1199-2